Positive bases with maximal cosine measure
نویسندگان
چکیده
منابع مشابه
A short proof on the cardinality of maximal positive bases
A positive basis is a minimal set of vectors whose nonnegative linear combinations span the entire space Rn. Interest in positive bases was revived in the late nineties by the introduction and analysis of some classes of direct search optimization algorithms. It is easily shown that the cardinality of every positive basis is bounded below by n + 1. There are proofs in the literature that 2n is ...
متن کاملCosine - Modulated Orthonormal Wavelet Bases
To give exibility to the time-frequency resolution trade-o of orthonormal (ON) wavelet bases constructed by I.Daubechies [2, 1], recently multiplicityM ON wavelet bases(more generally tight frames (TFs)) have been constructedby several authors [3, 4, ?, 7, 12]. These generalizations ofthe multiplicity 2 ON wavelet bases of I. Daubechies, di erfrom the latter in that, whi...
متن کاملLocal Sine and Cosine Bases
19 and = 1 + 1 m ; m a positive integer. If we let w(x) 1 p 2 R 1 ?1 e ixx ()dd, then w is a \mother function" that generates a wavelet basis (giving us a Multi Resolution Analysis) m ; m a positive integer. x6. Concluding remarks. We repeat that the local bases we developed in x2. were introduced by Coifman and Meyer, and their use in obtaining the smooth wavelet bases were pointed out to us b...
متن کاملSpeech compression with cosine and wavelet packet near-best bases
Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred ...
متن کاملTime-frequency analysis with best local cosine bases
We propose new best basis search algorithms for local cosine dictionaries. We provide several algorithms for dictionaries of various complexity. Our framework generalizes the classical best local cosine basis selection based on a dyadic tree [1].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2018
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-018-1334-y